A generalized assignment model for dynamic supply chain capacity planning

We consider a generalization of the well‐known generalized assignment problem (GAP) over discrete time periods encompassed within a finite planning horizon. The resulting model, MultiGAP, addresses the assignment of tasks to agents within each time period, with the attendant single‐period assignment costs and agent‐capacity constraint requirements, in conjunction with transition costs arising between any two consecutive periods in which a task is reassigned to a different agent. As is the case for its single‐period antecedent, MultiGAP offers a robust tool for modeling a wide range of capacity planning problems occurring within supply chain management. We provide two formulations for MultiGAP and establish that the second (alternative) formulation provides a tighter bound. We define a Lagrangian relaxation‐based heuristic as well as a branch‐and‐bound algorithm for MultiGAP. Computational experience with the heuristic and branch‐and‐bound algorithm on over 2500 test problems is reported. The Lagrangian heuristic consistently generates high‐quality and in many cases near‐optimal solutions. The branch‐and‐bound algorithm is also seen to constitute an effective means for solving to optimality MultiGAP problems of reasonable size. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

面向动作序列的敏捷卫星任务规划问题

针对新一代敏捷卫星对地观测任务规划问题,考虑了直拍直传、立体成像、多条带拼接等复杂任务需求和观测、数据下传、对日定向等九种卫星动作,在任务规划的同时进行卫星动作规划。设计并实现了前瞻启发式构造算法,算法满足卫星存储、能量等复杂约束,在前瞻过程中每次决定当前任务是否安排。采用基于专家知识的多种启发式规则决定任务安排与安排卫星动作序列。仿真实例及实际工程应用表明,算法可以在很短的时间内给出较好的结果,证明了本文方法对于敏捷卫星任务规划问题的适用性。     

Minimizing makespan in a multimode multiprocessor shop scheduling problem

We study the problem of multimode scheduling tasks on dedicated processors, with the objective of minimizing the maximum completion time. Each task can be undertaken in one among a set of predefined alternative modes, where each mode specifies a required set of dedicated processors and a processing time. At any time each processor can be used by a single task at most. General precedence constraints exist among tasks, and task preemption is not allowed. The problem consists of assigning a mode and a starting time to each task, respecting processor and precedence constraints, to minimize the time required to complete all tasks. The problem is NP-hard in several particular cases. In previous works, we studied algorithms in which a solution was obtained by means of an iterative procedure that combines mode assignment and sequencing phases separately. In this paper, we present some new heuristics where the decision on the mode assignment is taken on the basis of a partial schedule. Then, for each task, the mode selection and the starting time are chosen simultaneously considering the current processor usage. Different lower bounds are derived from a mathematical formulation of the problem and from a graph representation of a particular relaxed version of the problem. Heuristic solutions and lower bounds are evaluated on randomly generated test problems. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 893–911, 1999     

Two exact algorithms for the vehicle routing problem on trees

This article describes a heuristic and two exact algorithms for several classes of vehicle routing problems defined on tree networks. These include capacitated and time‐constrained vehicle routing problems. One of the exact algorithms is based on the computation of bin packing lower bounds. The other uses column generation. The first algorithm performs better on problems containing small customer demands and in which all vehicles are identical. Otherwise, the second algorithm is more powerful and more versatile. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 75–89, 1999     

大学物理课程学习指导规律初探

调查了学生在学习大学物理课程中的学习困难及原因,探索了大学物理课程的学习指导规律,提出了改进教学内容、教学方法与手段、课程教学管理以及作业布置的可行性建议,总结了教学效果。     

一种用于SpaceWire网络的混合路由机制设计*

针对星上系统总线多元性导致的星载网络接口和协议不能标准化的发展瓶颈,本文基于SpaceWire总线协议,通过将静态路由(时间触发)与动态路由(事件触发)机制结合,实现了控制数据和载荷数据共用网络。静态路由完全遵循SpaceWire-D协议,在保证确定性传输的同时,通过启发式调度算法首次实现了多时间窗并行调度,并提出利用最大公约数法设计时间窗,以提高网络吞吐量；动态路由通过对随机事件和载荷数据分配优先级,实现传输路径冲突时对紧急任务的优先处理。最后在OPENT中搭建网络系统仿真模型,对所提出的路由机制进行了仿真。实验结果表明,静态路由时段网络吞吐量较现有调度算法有明显提高,动态路由实现了紧急事件优先传输。     

维和警察防暴队迎战原则探析

维和警察防暴队在海地任务区遇到很多实际问题。在执勤执法中灵活运用迎战原则,探讨维和警察防暴队迎战原则的法律依据、行动授权和执行程序,总结在任务区复杂多变的情况下维和警察防暴队如何依托国际法规,合理运用迎战原则,有效使用武力授权,合法利用武器装备,严格遵守执行程序的措施和方法,对于完成维和任务具有一定的指导作用。     

新型小规模装备备件品种确定的犹豫模糊粗糙集决策方法

针对新研装备备件品种确定过程中决策信息“犹豫性”和“模糊性”特点突出、难以运用传统备件品种确定方法进行决策的问题,提出一种基于犹豫模糊粗糙集的备件品种确定方法。利用风险偏好系数对不完备犹豫模糊信息进行数值延拓,为构建不同风险偏好下备件品种确定的犹豫模糊决策信息系统奠定了基础；考虑得分函数和数值延拓边界的综合因素影响给出了改进的包含度计算公式,并基于包含度定义进行了证明；给出了基于改进包含度计算的备件品种决策属性的约简条件和规则获取方法,实现了犹豫模糊决策信息的深度挖掘和有效利用。以某新研装备备件品种确定为例进行了方法验证,研究结果表明：通过该法能够有效处理犹豫模糊决策信息,获取精简实用的备件品种决策规则集,验证了方法的可行性。     

可执行体系结构研究

体系结构是系统设计与实施的蓝图,它能否正确、合理地指导实践在很大程度上依赖于体系结构的验证与评估.可执行体系结构研究为体系结构验证与评估开辟了新的途径.为了使各体系结构产品在整体上形成一个执行体,提出了可执行体系结构执行规则描述这一个概念.执行规则描述体系结构产品的执行、调用与数据流关系,为体系结构的执行提供了特定的背景信息.它通过标准的动态可执行模型接口分别调用该模型的执行引擎,从而达到体系结构在整体上执行的目的.体系结构的正确执行为体系结构验证提供依据,同时其运行结果为体系结构的评估提供依据.     

模糊启发规则的防空作战智能指控系统决策

为提高防空作战智能指控系统决策效率,在充分考虑专家经验知识的基础上,利用模糊启发规则对智能指控系统决策模型中的规则和推理方法进行改进.通过对防空作战打击决策输出结果的编程计算,得到打击决策输出方案与实际作战决策结果一致.该方法可使模糊规则条数减少,输入向量和模糊矩阵的维数降低,推理计算速度加快,却不影响最终决策输出结果.